By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 11, Issue 4, pp. 511-671

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Geometric Approach to Betweenness

Benny Chor and Madhu Sudan

pp. 511-523

BibTeX  Abstract Full Text:  PDF

The Graphs with All Subgraphs T-Perfect

A. M. H. Gerards and F. B. Shepherd

pp. 524-545

BibTeX  Abstract Full Text:  PDF

Monochromatic Paths and Triangulated Graphs

Shimon Even, Ami Litman, and Arnold L. Rosenberg

pp. 546-556

BibTeX  Abstract Full Text:  PDF

Two Arc-Disjoint Paths in Eulerian Digraphs

András Frank, Toshihide Ibaraki, and Hiroshi Nagamochi

pp. 557-589

BibTeX  Abstract Full Text:  PDF

Multiple Capacity Vehicle Routing on Paths

D. J. Guan and Xuding Zhu

pp. 590-602

BibTeX  Abstract Full Text:  PDF

Edge-Connectivity Augmentation Preserving Simplicity

Jørgen Bang-Jensen and Tibor Jordán

pp. 603-623

BibTeX  Abstract Full Text:  PDF

Dimension of Projections in Boolean Functions

Ramamohan Paturi and Francis Zane

pp. 624-632

BibTeX  Abstract Full Text:  PDF

k-Neighborhood-Covering and -Independence Problems for Chordal Graphs

Shiow-Fen Hwang and Gerard J. Chang

pp. 633-643

BibTeX  Abstract Full Text:  PDF

Local Structure When All Maximal Independent Sets Have Equal Weight

Yair Caro, M. N. Ellingham, and J. E. Ramey

pp. 644-654

BibTeX  Abstract Full Text:  PDF

On the Weakness of an Ordered Set

John G. Gimbel and Ann N. Trenk

pp. 655-663

BibTeX  Abstract Full Text:  PDF

A New Decoding Algorithm for Complete Decoding of Linear Block Codes

Yunghsiang S. Han

pp. 664-671

BibTeX  Abstract Full Text:  PDF